On Minimizing Quadratically Constrained Ratio of Two Quadratic Functions
نویسندگان
چکیده
We consider the nonconvex problem minimizing the ratio of two quadratic functions over finitely many nonconvex quadratic inequalities. Relying on the homogenization technique we establish a sufficient condition that warrants the attainment of an optimal solution. Our result allows to extend and recover known conditions for some interesting special instances of the problem and to derive further results on its algorithmic and modeling aspects.
منابع مشابه
SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملFinding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
We consider the problem of minimizing a fractional quadratic problem involving the ratio of two indefinite quadratic functions, subject to a two sided quadratic form constraint. This formulation is motivated by the so-called Regularized Total Least Squares problem (RTLS). A key difficulty with this problem is its nonconvexity, and all current known methods to solve it are only guaranteed to con...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملA Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming
In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a convex quadratic function subject to finitely many convex quadratic inequality constraints. The algorithm is shown to converge globally and possess stronger local superlinear convergence. Preliminary numerical results are also reported.
متن کاملOn convex relaxations for quadratically constrained quadratic programming
We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let F denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on F is dominated by an alternative methodology based ...
متن کامل